منابع مشابه
On the Complementation of Asynchronous Cellular Büchi Automata
We present direct subset automata constructions for asynchronous (asyn-chronous cellular, resp.) automata. This provides a solution to the problem of direct determinization for automata with distributed control for languages of nite traces. We use the subset automaton construction and apply Klarlund's progress measure technique in order to complement non-deterministic asynchronous cellular B uc...
متن کاملBüchi Complementation
This entry provides a verified implementation of rank-based Büchi Complementation [1]. The verification is done in three steps: 1. Definition of odd rankings and proof that an automaton rejects a word iff there exists an odd ranking for it. 2. Definition of the complement automaton and proof that it accepts exactly those words for which there is an odd ranking. 3. Verified implementation of the...
متن کاملThe Büchi Complementation Saga
The complementation problem for nondeterministic word automata has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems are reduced, involves complementation. For automata on finite words, which correspond to safety properties, complementation involves determinization. The 2 blow-up that is caused by the subset constr...
متن کاملState of Büchi Complementation
Complementation of Büchi automata has been studied for over five decades since the formalism was introduced in 1960. Known complementation constructions can be classified into Ramsey-based, determinization-based, rank-based, and slice-based approaches. Regarding the performance of these approaches, there have been several complexity analyses but very few experimental results. What especially la...
متن کاملBüchi Complementation Made Tighter
The complementation problem for nondeterministic word automata has numerous applications in formal verification. In particular, the language-containment problem, to which many verification problems is reduced, involves complementation. For automata on finite words, which correspond to safety properties, complementation involves determinization. The 2 blow-up that is caused by the subset constru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1986
ISSN: 0304-3975
DOI: 10.1016/0304-3975(86)90136-2